generalized algorithmの例文
- Church subsequently modified his methods to include use of Herbrand G鰀el recursion and then proved ( 1936 ) that the Entscheidungsproblem is unsolvable : there is no generalized algorithm that can determine whether a well formed formula has a " normal form ".
- But Chaitin proved that compacting an algorithm cannot be automated by a generalized algorithm; rather, it can only be done heuristically; i . e ., by exhaustive search ( examples to be found at Busy beaver ), trial and error, cleverness, insight, application of inductive reasoning, etc . Observe that steps 4, 5 and 6 are repeated in steps 11, 12 and 13.
- i'm studying permutations and combinatorics for this entrance exam and i just thought of a really interesting ( not sure if its feasible ) problem : In a 3d orthogonal coordinate system, in how many ways could u move from a point ( 2, 3, 5 ) to a point ( 9, 11, 14 ) [ ( or in general from ( x, y, z ) to ( x', y', z') ] assuming that u could only move parallel to the coordinate axes and on integral points . Is there some sort of generalized algorithm to find the solution ? ? 59.183.42.170 18 : 24, 6 March 2007 ( UTC)
